Adaptive detectors in the Krylov subspace

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduced-Rank Adaptive Filtering Using Krylov Subspace

A unified view of several recently introduced reduced-rank adaptive filters is presented. As all considered methods use Krylov subspace for rank reduction, the approach taken in this work is inspired from Krylov subspace methods for iterative solutions of linear systems. The alternative interpretation so obtained is used to study the properties of each considered technique and to relate one red...

متن کامل

Robust Krylov-Subspace Methods for Passive Sonar Adaptive Beamforming

Krylov-subspace methods, such as the multistage Wiener filter and conjugate gradient method, are often used for reduced-dimension adaptive beamforming. These techniques do not, however, allow for steering vector mismatch, which is typically present in many applications of interest, including passive sonar. Here, we discuss recently proposed robust methods that do allow for steering vector misma...

متن کامل

Krylov Subspace Methods for Topology Optimization on Adaptive

Topology optimization is a powerful tool for global and multiscale design of structures, microstructures, and materials. The computational bottleneck of topology optimization is the solution of a large number of extremely ill-conditioned linear systems arising in the finite element analysis. Adaptive mesh refinement (AMR) is one efficient way to reduce the computational cost. We propose a new A...

متن کامل

Krylov subspace iteration

In the simulation of continuous events, such as the ow of a uid through a pipe, or the ow of air around an aircraft, one usually imposes a grid over the area of interest and one restricts oneself to the computation of relevant parameters, for instance the pressure or the velocity of the ow or the temperature, in the gridpoints. Physical laws lead to approximate relations between these parameter...

متن کامل

Krylov subspace estimation

Computing the linear least-squares estimate of a high-dimensional random quantity given noisy data requires solving a large system of linear equations. In many situations, one can solve this system e ciently using a Krylov subspace method, such as the conjugate gradient (CG) algorithm. Computing the estimation error variances is a more intricate task. It is di cult because the error variances a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2014

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-014-5080-1